Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
نویسندگان
چکیده
منابع مشابه
On the Wagner-Whitin Lot-Sizing Polyhedron
We study a family of unbounded polyhedra arising in the study of uncapacitated lot-sizing problems with Wagner-Whitin costs. With n the number of periods, we completely characterize the bounded faces of maximal dimension, and derive an O(n) algorithm to express any point within the polyhedron as a convex combination of extreme points and extreme rays. We also study adjacency on the polyhedra, a...
متن کاملAn Improved WAGNER-WHITIN Algorithm
We present an improved implementation of the Wagner-Whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the Economic- Part-Period concept. The proposed method of this paper reduces the burden of the computations significantly in two different cases. We first assume there is no backlogging and inventory holding and set-up costs are fixed. The second model ...
متن کاملOn the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
We consider the single-item discrete lot-sizing and scheduling problem. We present a partial linear description of the convex hull of feasible solutions that solves this problem in the presence of Wagner-Whitin costs.
متن کاملTechnical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
Ravindra K. Ahuja and Dorit S. Hochbaum Abstract In this paper, we study capacitated dynamic lot sizing problems with or without backorders, under the assumption that production costs are linear, that is, there are no set up costs. These two dynamic lot sizing problems (with or without backorders) are minimum cost flow problems on an underlying network that possess a special structure. We show ...
متن کاملan improved wagner-whitin algorithm
we present an improved implementation of the wagner-whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the economic- part-period concept. the proposed method of this paper reduces the burden of the computations significantly in two different cases. we first assume there is no backlogging and inventory holding and set-up costs are fixed. the second model ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1992
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.40.1.s145